An iterated multi-stage selection hyper-heuristic
نویسندگان
چکیده
منابع مشابه
An iterated multi-stage selection hyper-heuristic
There is a growing interest towards the design of reusable general purpose search methods that are applicable to different problems instead of tailored solutions to a single particular problem. Hyper-heuristics have emerged as such high level methods that explore the space formed by a set of heuristics (move operators) or heuristic components for solving computationally hard problems. A selecti...
متن کاملAn Ant-Based Selection Hyper-heuristic for Dynamic Environments
Dynamic environment problems require adaptive solution methodologies which can deal with the changes in the environment during the solution process for a given problem. A selection hyper-heuristic manages a set of low level heuristics (operators) and decides which one to apply at each iterative step. Recent studies show that selection hyperheuristic methodologies are indeed suitable for solving...
متن کاملEvolutionary Hyper - Heuristics for Heuristic Selection
Hyper-heuristics are an emerging that has received increasing attention in the last years. As they are black box optimization techniques that work on higher level of abstraction, they have many real world application. This work aims to explore the possibilities of application of evolutionary algorithms and related methods in the field of hyper-heuristics. Their properties make them a particular...
متن کاملMulti-objective Hyper-heuristic Evolutionary Algorithm
This paper presents a Multi-objective Hyper-heuristic Evolutionary Algorithm (MHypEA) for the solution of Scheduling and Inspection Planning in Software Development Projects. Scheduling and Inspection planning is a vital problem in software engineering whose main objective is to schedule the persons to various activities in the software development process such as coding, inspection, testing an...
متن کاملHyperILS: An Effective Iterated Local Search Hyper-heuristic for Combinatorial Optimisation
Two powerful ideas from search methodologies, iterated local search and hyperheuristics, are combined into a simple and effective framework to solve combinatorial optimisation problems (HyperILS). Iterated local search is a simple but successful algorithm. It operates by iteratively alternating between applying a move operator to the incumbent solution and restarting local search from the pertu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2016
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2015.09.003